Cyclic and Inductive Calculi are equivalent
نویسندگان
چکیده
Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reaching the important conclusion that it is at least as powerful as inductive reasoning (specifically, they showed that each inductive proof can be translated into a cyclic proof). We add to their investigation by proving the converse of this result, namely that each inductive proof can be translated into an inductive one. This, in effect, establishes the equivalence between first order cyclic and inductive calculi.
منابع مشابه
Sequent calculus proof systems for inductive definitions
Inductive definitions are the most natural means by which to represent many families of structures occurring in mathematics and computer science, and their corresponding induction / recursion principles provide the fundamental proof techniques by which to reason about such families. This thesis studies formal proof systems for inductive definitions, as needed, e.g., for inductive proof support ...
متن کاملClassical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs
A cyclic proof system, called CLKID-omega, gives us another way of representing inductive definitions and effcient proof search. The 2011 paper by Brotherston and Simpson showed that the provability of CLKID-omega includes the provability of Martin-Lof's system of inductive definitions, called LKID, and conjectured the equivalence. Since then, the equivalence has been left an open question. Thi...
متن کاملAntioxidant Activity and Electrochemical Properties of Tetradentate Schiff Bases and Their Cd(II) Complexes
This study describes the effects of the substituents on electrochemical behavior and antioxidant activity of the three tetradentate Schiff bases, containing ethane-1,2- diamine, propane-1,3- diamine and butan-1,4- diamine as the amine part and salicylaldehyde, and corresponding Cd(II) complexes. Cyclic voltammograms of these compounds were recorded in dimethylsulfoxide and 0.1 M sodium perchlor...
متن کاملThe Ideal of the Completeness of Calculi of Inductive Inference: an Introductory Guide to Its Failure
Non-trivial calculi of inductive inference are incomplete. This result is demonstrated formally elsewhere (Norton, manuscript). Here the significance and background to the result is described. This note explains what is meant by incompleteness, why it is desirable, if only it could be secured, and it gives some indication of the arguments needed to establish its failure. The discussion will be ...
متن کاملAxioms in Definitional Calculi
This paper introduces a restricted form of the axiom rule in calculi of Partial Inductive Definitions (PID). The paper argues that in calculi of PIDs the distinction between atomic and non-atomic formulae is not as clear as in traditional sequent calculi. Therefore the common restriction of the axiom rule to the atomic case is not adequate for this type of calculi. A novel proviso for the axiom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.4694 شماره
صفحات -
تاریخ انتشار 2011